An Improve Shannon Fano Data Compression Algorithm using Residue Number System
نویسندگان
چکیده
منابع مشابه
A Division Algorithm Using Bisection Method in Residue Number System
Residue Number System (RNS) has computational advantages for large integer arithmetic. It provides the benefits of parallel, carry-free, and high-speed arithmetic in addition, subtraction, and multiplication. However, overflow detection, sign detection, magnitude detection, and division are time-consuming operations in RNS. The most interesting one of the above operations is division, and many ...
متن کاملData Conversion in Residue Number System
This thesis tackles the problem of data conversion in the Residue Number System (RNS). The RNS has been considered as an interesting theoretical topic for researchers in recent years. Its importance stems from the absence of carry propagation between its arithmetic units. This facilitates the realization of high-speed, low-power arithmetic. This advantage is of paramount importance in embedded ...
متن کاملAn Efficient Oblivious Transfer Protocol Using Residue Number System
Because the t-out-of-n oblivious transfer (OT) protocol can guarantee the privacy of both participants, i.e., the sender and the receiver, it has been used extensively in the study of cryptography. Recently, Chang and Lee presented a robust t-out-of-n OT protocol based on the Chinese remainder theorem (CRT). In this paper, we use the Aryabhata remainder theorem (ART) to achieve the functionalit...
متن کاملHigh Performance Adder Using Residue Number System
The Residue Number System based on 2 n 2 k -1 moduli set is used in the proposed model. There are more number of moduli sets among them the above mentioned one is having high performance than the other. Adder is one of the key components for the application of Residue number system (RNS). Moduli set 2 n -2 k -1 where n=16 and k=14 with the form can offer excellent balance among the RNS channels...
متن کاملEfficient Adaptive Data Compression Using Fano Binary Search Trees
In this paper, we show an effective way of using adaptive self-organizing data structures in enhancing compression schemes. We introduce a new data structure, the Partitioning Binary Search Tree (PBST), which is based on the well-known Binary Search Tree (BST), and when used in conjunction with Fano encoding, the PBST leads to the so-called Fano Binary Search Tree (FBST). The PBST and FBST can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Applied Electronics
سال: 2021
ISSN: 2394-4714
DOI: 10.5120/cae2021652881